Planning Under Time Pressure

Heuristic search is a technique used pervasively in the fieldsof artificial intelligence, automated planning and operations research to solve wide range of problems from military deployments tasks for robot that must clean messy kitchen. An agent can use heuristic construct plan that, when executed, will achieve desired task. The algorithm explores different sequences actions execute, looking sequence lead it goal state. In many situations, an given task would like as quickly possible. allocate its time between searching actually executing them. We call this problem under pressure.